Complete parameterization of piecewise-polynomial interpolation kernels
نویسندگان
چکیده
منابع مشابه
Complete parameterization of piecewise-polynomial interpolation kernels
Every now and then, a new design of an interpolation kernel appears in the literature. While interesting results have emerged, the traditional design methodology proves laborious and is riddled with very large systems of linear equations that must be solved analytically. We propose to ease this burden by providing an explicit formula that can generate every possible piecewise-polynomial kernel ...
متن کاملFast LIC with Piecewise Polynomial Filter Kernels
Line integral convolution (LIC) has become a well-known and popular method for visualizing vector elds. The method works by convolving a random input texture along the integral curves of the vector eld. In order to accelerate image synthesis signiicantly, an eecient algorithm has been proposed that utilizes pixel coherence in eld line direction. This algorithm, called \fast LIC", originally was...
متن کاملOn Channel Equalization Using Piecewise Polynomial Kernels
A recent approach to understanding the channel equalization problem is based on function approximation theory. From this approach, it is known that the optimal equalizer is nonlinear even for linear channels. Moreover, Volter-ra-based equalizers and decision feedback equalizers (DFE) ooer restricted exibility for representing the nonlinear dis-criminant required in many cases. This fact has mot...
متن کاملPiecewise Polynomial Kernels for Image Interpolation: A Generalization of Cubic Convolution
A well-known approach to image interpolation is cubic convolution, in which the ideal sinc function is modelled by a finite extent kernel, which consists of piecewise third order polynomials. In this paper we show that the concept of cubic convolution can be generalized. We derive kernels of up to ninth order and compare them both mutually and to cardinal splines of corresponding orders. From s...
متن کاملHermite interpolation by piecewise polynomial surfaces with polynomial area element
This paper is devoted to the construction of polynomial 2-surfaces which possess a polynomial area element. In particular we study these surfaces in the Euclidean space R (where they are equivalent to the PN surfaces) and in the Minkowski space R (where they provide the MOS surfaces). We show generally in real vector spaces of any dimension and any metric that the Gram determinant of a parametr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Image Processing
سال: 2003
ISSN: 1057-7149
DOI: 10.1109/tip.2003.818018